Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named\nHCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical\ntasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks\nwith less predecessors to schedule. In resource selection phase, the algorithm is selected task duplication to reduce the interresource\ncommunication cost, besides forecasting the impact of an assignment for all children of the current task permits better decisions to\nbe made in selecting resources. The algorithm proposed is compared with STDH, PEFT, and HEFT algorithms through randomly\ngenerated graphs and sets of task graphs. The experimental results show that the new algorithm can achieve better scheduling\nperformance.
Loading....